Efficient multicast search under delay and bandwidth constraints
نویسندگان
چکیده
The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. A. Bar-Noy Computer and Information Science Department, Brooklyn College, 2900, Bedford Avenue Brooklyn, NY 11210 e-mail: [email protected] Z. Naor ( ) University of Haifa, Israel e-mail: [email protected]
منابع مشابه
A Multicast Search Scheme Based on Bipartite Graph Matching Model
This paper proposes an efficient multicast search scheme based on bipartite graph matching model, aiming at one of the most important problems in the multicast service, how can the wireless network track and locate the mobile uses in the idle state, under the tight bandwidth and delay constraints,. By quantifying the location uncertainty of mobile users with Shannon's entropy, the scheme adopts...
متن کاملDynamic Routing to Multiple Destinations in IP Networks using Hybrid Genetic Algorithm (DRHGA)
In this paper we have proposed a novel dynamic least cost multicast routing protocol using hybrid genetic algorithm for IP networks. Our protocol finds the multicast tree with minimum cost subject to delay, degree, and bandwidth constraints. The proposed protocol has the following features: i. Heuristic local search function has been devised and embedded with normal genetic operation to increas...
متن کاملA tree-growth based ant colony algorithm for QoS multicast routing problem
QoS multicast routing is a non-linear combinatorial optimization problem. It tries to find a multicast routing tree with minimal cost that can satisfy constraints such as bandwidth, delay, and delay jitter. This problem is NP-complete. The solution to such problems is often to search first for paths from the source node to each destination node and then integrate these paths into a multicast tr...
متن کاملEfficient Multicast Routing Protocol for Manets
Mobile ad hoc networks (MANETs) have several prominent features because of which MANETs are visualized to support advanced applications. Multicast routing reduces the communication costs of applications. Several multicast routing protocols have been proposed for MANET. While previous MANET multicast protocols focused on the reductions of control overhead, the multicast protocol investigated in ...
متن کاملPolynomial Algorithm for Bandwidth-Delay-Constrained Multicast Routing Problem
Most network-based multimedia applications require multicasting with constraints such as bandwidth and delay in order to support group communication and their quality of services (QoS). This can be considered as the problem of constructing a multicast tree with delay and bandwidth constraints over a given network topology. This paper proposes a novel algorithm to solve this problem with a small...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Wireless Networks
دوره 12 شماره
صفحات -
تاریخ انتشار 2006